137. Single Number II.c

/*
137. Single Number II

Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one.



Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
*/

intsingleNumber(int*nums, intnumsSize) {
    inti, ones, twos;
    ones=twos=0;
    for (i=0; i<numsSize; i++) {
        ones= (ones ^ nums[i]) & ~twos;
        twos= (twos ^ nums[i]) & ~ones;
   }
    returnones;
}


/*
Difficulty:Medium
Total Accepted:119.8K
Total Submissions:288.6K


Related Topics Bit Manipulation
Similar Questions Single Number Single Number III

*/